Maximum-scoring segment sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High scoring segment selection for pairwise whole genome sequence alignment with the maximum scoring subsequence and GPUs

Whole genome alignment programs use exact string matching with hash tables to quickly identify high scoring fragments between a query and target sequence around which a full alignment is then built. In a recent large-scale comparison of alignment programs called Alignathon it was discovered that while evolutionary similar genomes were easy to align, divergent genomes still posed a challenge to ...

متن کامل

Computing Maximum-Scoring Segments Optimally

Given a sequence of length n, the problem studied in this paper is to find a set of k disjoint subsequences of consecutive elements such that the total sum of all elements in the set is maximized. This problem arises in the analysis of DNA sequences. The previous best known algorithm requires Θ(nα(n, n)) time in the worst case, where α(n, n) is the inverse Ackermann function. We present a linea...

متن کامل

Algorithms for Maximum Independent Sets

An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O(2°.276”) ’ p lm roving on a previous bound of O(2”13). The improvement comes principally from three sources: first, a modified recursive algorithm based on a more detailed study of the possible subgraphs around a chosen vertex; second, an improvement, not in the algorithm but in the time...

متن کامل

Algorithms for Problems on Maximum Density Segment

Let A be a sequence of n ordered pairs of real numbers (ai, li) (i = 1, . . . , n) with li > 0, and L and U be two positive real numbers with 0 < L U . A segment, denoted by A[i, j], 1 i j n, of A is a consecutive subsequence of A between the indices i and j (i and j included). The length l[i, j], sum s[i, j] and density d[i, j] of a segment A[i, j] are l[i, j] = ∑j t=i lt, s[i, j] = ∑j t=i at ...

متن کامل

An Analysis of TCP Maximum Segment Sizes

The Maximum Segment Size (MSS) is a basic yet critical property of any TCP connection. Yet surprisingly, there have been no recent studies examining the MSS values that are announced and utilised by TCP senders in any detail. This paper analyses packet traces from several different locations and investigates the advertised and observed MSS values for each captured TCP connection. In particular,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics

سال: 2004

ISSN: 1545-5963

DOI: 10.1109/tcbb.2004.43